Efficient Labelling and Constraint Relaxation for Solving Time Tabling Problems
نویسندگان
چکیده
Constraint Logic Programming over Finite Domains, CLP(FD), has been in constant development for a few years. CLP(FD) allows an efficient resolution of various highly combinatorial problems in scheduling, cutting-stock, warehouse location, planning, molecular biology ... [DIN 90a,b,c], [BAP 92], [BEL 92], [CHA 92], [CLA 93], [BOI 94b]. From a software engineering view point, this approach provides an easy prototyping and induces rapid development times. This is due to the integration of a powerful constraint propagation mechanism (Consistency Techniques) in a Logic Programming language (Prolog).
منابع مشابه
Solving a Time Tabling Problem by Constraint Satisfaction
The time tabling problem is well known and much research has been done about it. This paper shows how a difficult instance of the time tabling problem with many parameters and loose constraints can be handled using constraint satisfaction. To this end the constraints have to be modeled in a format that can be handled efficiently. It is shown how several modelling problems can be solved in a gen...
متن کاملOn the Parallel Complexity of Some Constraint Satisfaction Problems
Constraint satisfaction networks have been shown to be a very useful tool for knowledge representation in Artificial Intelligence applications. These networks often utilize local constraint propagation techniques to achieve global consistency (consistent labelling in vision). Such methods have been used extensively in the context of image understanding and interpretation, as well as planning, n...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling means assigning a value to a variable.) Solu...
متن کاملA New Method for Solving Constraint Satisfaction Problems
Many important problems in Artificial Intelligence can be defined as Constraint Satisfaction Problems (CSP). These types of problems are defined by a limited set of variables, each having a limited domain and a number of Constraints on the values of those variables (these problems are also called Consistent Labeling Problems (CLP), in which “Labeling" means assigning a value to a variable.) Sol...
متن کاملHybrid Solving for CSP
Constraint Satisfaction Problems (CSP) [27] provide a general framework for the modeling of many practical applications (planning, scheduling, time tabling,...). Many examples of such constraint satisfaction problems can be found in [12]. A CSP is usually defined by a set of variables associated to domains of possible values and by a set of constraints. We only consider here CSP over finite dom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994